Some Properties of Non-Orthogonal Term Graph Rewriting
نویسندگان
چکیده
منابع مشابه
Some properties of non-orthogonal term graph rewriting systems
This paper examines left-linear non-orthogonal term graph rewriting systems that allow asymmetric connicts between redexes. Using a deenition of compatibility of sequences based on Boudol's work on the semantics of term rewriting, it shows that two properties associated with functional languages are true of such graph rewriting systems. First, that a notion of standard computation can be deened...
متن کاملEvent Structures and Non-Orthogonal Term Graph Rewriting
Received 1. Abstract We show that for every term graph in a left-linear but non-orthogonal term graph rewrite system, one can construct an event structure which represents all the possible reductions which can occur in reduction sequences starting from that term graph. Every nite reduction sequence from that graph corresponds to a connguration of the event structure, and L evy-equivalent sequen...
متن کاملTerm Graph Rewriting and Parallel Term Rewriting
The relationship between Term Graph Rewriting and Term Rewriting is well understood: a single term graph reduction may correspond to several term reductions, due to sharing. It is also known that if term graphs are allowed to contain cycles, then one term graph reduction may correspond to infinitely many term reductions. We stress that this fact can be interpreted in two ways. According to the ...
متن کاملInfinitary Term Rewriting for Weakly Orthogonal Systems: Properties and Counterexamples
We present some contributions to the theory of infinitary rewriting for weakly orthogonal term rewrite systems, in which critical pairs may occur provided they are trivial. We show that the infinitary unique normal form property (UN) fails by an example of a weakly orthogonal TRS with two collapsing rules. By translating this example, we show that UN also fails for the infinitary λβη-calculus. ...
متن کاملTerm Graph Rewriting 5 4 Adequacy of Graph Rewriting for Term Rewriting 8 5 Implementing Term Rewriting
Recently, many techniques have been introduced that allow the (automated) classification of the runtime complexity of term rewrite systems (TRSs for short). In earlier work, the authors have shown that for confluent TRSs, innermost polynomial runtime complexity induces polytime computability of the functions defined. In this paper, we generalise the above result to full rewriting. Following our...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 1995
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(05)80179-3